Fixed point analysis of the constant modulus algorithm

نویسندگان

  • Nabil R. Yousef
  • Ali H. Sayed
چکیده

The steady-state performance of adaptive equalizers can significantly vary when they are implemented in finite precision arithmetic, which makes it vital to analyze their performance in a quantized environment. In this paper we present a fixed point analysis for the steady-state mean square error (MSE) of a blind adaptive equalizer and the optimal value of the step-size that minimizes this MSE. Such expressions are useful for selecting the adequate wordlength of a blind equalizer to achieve a specific desired steady-state performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Frailty and Change Point Models for Recurrent Events Data

Abstract. We present a Bayesian analysis for recurrent events data using a nonhomogeneous mixed Poisson point process with a dynamic subject-specific frailty function and a dynamic baseline intensity func- tion. The dynamic subject-specific frailty employs a dynamic piecewise constant function with a known pre-specified grid and the baseline in- tensity uses an unknown grid for the piecewise ...

متن کامل

Blind adapted, pre-whitened constant modulus algorithm

We examine the use of a blind adaptive “pre-whitening” filter to precede an equalizer adapted by the constant modulus algorithm (CMA). The idea is based on results presented in which the use of a (fixed, or non-adaptive) pre-whitening filter provides an isometry (i.e. geometry preserving transformation) between the combined channel-equalizer (or global space) and the equalizer tap space. As muc...

متن کامل

A Class of nonlinear $(A,eta)$-monotone operator inclusion problems with iterative algorithm and fixed point theory

A new class of nonlinear set-valued variationalinclusions involving $(A,eta)$-monotone mappings in a Banachspace setting is introduced, and then based on the generalizedresolvent operator technique associated with$(A,eta)$-monotonicity, the existence and approximationsolvability of solutions using an iterative algorithm and fixedpint theory is investigated.

متن کامل

The James and von Neumann-Jordan type constants and uniform normal structure in Banach spaces

Recently, Takahashi has introduced the James and von Neumann-Jordan type constants. In this paper, we present some sufficient conditions for uniform normal structure and therefore the fixed point property of a Banach space in terms of the James and von Neumann-Jordan type constants and the Ptolemy constant. Our main results of the paper significantly generalize and improve many known results in...

متن کامل

On new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces

In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001